Isolated trees in a random graph
نویسندگان
چکیده
منابع مشابه
A Pointwise Approximation of Isolated Trees in a Random Graph
In this paper, we give a pointwise approximation of the number of isolated trees of order k in a random graph by Poisson distribution. The technique we used here is the Stein’s method.
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملDiameter of random spanning trees in a given graph
We show that a random spanning tree formed in a general graph G (such as a power law graph) has diameter much larger than the diameter of G. We show, with high probability the diameter of a random spanning tree of G is shown to be between c √ n and c′ √ n log n, where c and c′ depend on the spectral gap of G and the ratio of the moments of the degree sequence. For the special case of regular gr...
متن کاملOnline Graph Prediction with Random Trees
In online transductive graph prediction a learner is initially given an undirected graph G = (V,E) with unknown binary labels y = (y1, . . . , yn) ∈ {−1,+1}n assigned to the vertices V = {1, . . . , n}. At time t = 1 an arbitrary vertex i1 ∈ V is selected and the learner must predict its label yi1 ∈ {−1,+1}. Then yi1 is revealed and a new vertex i2 6= i1 of V is selected. This process goes on f...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1982
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-17-2-309-316